Cross-Over Spanning Trees
نویسنده
چکیده
The economics and familiarity of Ethernet technology is motivating the vision of wide-scale adoption of Metro Ethernet Networks (MEN). Despite the progress made by the community on additional Ethernet standardization and commercialization of the first generation of MEN, the fundamental technology does not meet the expectations that carriers have traditionally held in terms of network resiliency and load management. These two important features of MEN have been addressed in this paper. We propose a new concept of Cross-Over Spanning Trees (COST) that increases the resiliency of the MEN while provisioning the support for load balancing. As a result, the capacity in terms of network throughput is greatly enhanced while almost avoiding any re-convergence time in the case of failures. The gain ranges from 1.69% to 7.3% of the total traffic in the face of failure; while load balancing increases an additional 12.76% to 37% of the total throughput. KeywordsCross-Over Spanning Trees, Load Balancing, Metro Ethernet Network, MSTP, Resilience, RSTP.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملChronological Studies of Traffic Pollution Using Elemental Analysis of Tree Rings: Case Study of Haatso-atomic Road
Mitigation of atmospheric pollution has been a topic of concern over the past decades. In this study, tree rings have been used to reconstruct past climates as well as to assess the effects of recent climatic and environmental changes on tree growth. Vehicular emission is one of the major sources of pollutants in the atmosphere and this study focused on the Haatso-Atomic road which over the yea...
متن کاملChronological Studies of Traffic Pollution Using Elemental Analysis of Tree Rings: Case Study of Haatso-atomic Road
Mitigation of atmospheric pollution has been a topic of concern over the past decades. In this study, tree rings have been used to reconstruct past climates as well as to assess the effects of recent climatic and environmental changes on tree growth. Vehicular emission is one of the major sources of pollutants in the atmosphere and this study focused on the Haatso-Atomic road which over the yea...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کامل